Between Belief Bases and Belief Sets: Partial Meet Contraction
نویسندگان
چکیده
In belief revision, the result of a contraction should be a logically closed set (closure) such that the input is not inferred (success). Traditionally, these two postulates depend on the same consequence operator. The present work investigates the consequences of using two different consequence operators for each of these desiderata: the classic Cn to compute success and a second weaker operator to compute the closure. We prove a representation theorem and some other properties for the new contraction.
منابع مشابه
Horn Clause Contraction Functions: Belief Set and Belief Base Approaches
Standard approachs to belief change assume that the underlying logic contains classical propositional logic. Recently there has been interest in investigating approaches to belief change, specifically contraction, in which the underlying logic is not as expressive as full propositional logic. In this paper we consider approaches to belief contraction in Horn knowledge bases. We develop two broa...
متن کاملOn the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic
Standard belief change assumes an underlying logic containing full classical propositional logic. However, there are good reasons for considering belief change in less expressive logics as well. In this paper we build on recent investigations by Delgrande on contraction for Horn logic. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. This result...
متن کاملOn the Logic of Theory Change: Extending the AGM Model
Fermé, Eduardo. 2011. On the Logic of Theory Change: Extending the AGM Model. PhD Thesis in Philosophy from the Royal Institute of Technology. This thesis consists in six articles and a comprehensive summary. ● The pourpose of the summary is to introduce the AGM theory of belief change and to exemplify the diversity and significance of the research that has been inspired by the AGM article in t...
متن کاملHorn Clause Contraction Functions
In classical, AGM-style belief change, it is assumed that the underlying logic contains classical propositional logic. This is clearly a limiting assumption, particularly in Artificial Intelligence. Consequently there has been recent interest in studying belief change in approaches where the full expressivity of classical propositional logic is not obtained. In this paper we investigate belief ...
متن کاملContraction in Propositional Logic
The AGM model for the revision and contraction of belief sets provides rationality postulates for each of the two cases. In the context of finite propositional logic, Katsuno and Mendelzon pointed out postulates for the revision of belief bases which correspond to the AGM postulates for the revision of beliefs sets. In this paper, we present postulates for the contraction of propositional belie...
متن کامل